The lattice of antichain cutsets of a partially ordered set
نویسندگان
چکیده
منابع مشابه
Sampling of Multiple Variables Based on Partially Ordered Set Theory
We introduce a new method for ranked set sampling with multiple criteria. The method relaxes the restriction of selecting just one individual variable from each ranked set. Under the new method for ranking, units are ranked in sets based on linear extensions in partially order set theory with considering all variables simultaneously. Results willbe evaluated by a relatively extensive simulation...
متن کاملAntichain Cutsets of Strongly Connected Posets
Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We ...
متن کاملPartitions of a Finite Partially Ordered Set
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these notions we will find three equivalent definitions, that will be shown to be equivalent. We start by defining partitions of a poset in terms of fibres of some su...
متن کاملthe effect of consciousness raising (c-r) on the reduction of translational errors: a case study
در دوره های آموزش ترجمه استادان بیشتر سعی دارند دانشجویان را با انواع متون آشنا سازند، درحالی که کمتر به خطاهای مکرر آنان در متن ترجمه شده می پردازند. اهمیت تحقیق حاضر مبنی بر ارتکاب مکرر خطاهای ترجمانی حتی بعد از گذراندن دوره های تخصصی ترجمه از سوی دانشجویان است. هدف از آن تاکید بر خطاهای رایج میان دانشجویان مترجمی و کاهش این خطاها با افزایش آگاهی و هوشیاری دانشجویان از بروز آنها است.از آنجا ک...
15 صفحه اولThe Total Weak Discrepancy of a Partially Ordered Set
We define the total weak discrepancy of a poset P as the minimum nonnegative integer k for which there exists a function f : V → Z satisfying (i) if a ≺ b then f(a) + 1 ≤ f(b) and (ii) ∑ |f(a)− f(b)| ≤ k, where the sum is taken over all unordered pairs {a, b} of incomparable elements. If we allow k and f to take real values, we call the minimum k the fractional total weak discrepancy of P . The...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90368-c